Computing left Kan extensions
نویسندگان
چکیده
We describe a new extension of the Todd–Coxeter algorithm adapted to computing left Kan extensions. The algorithm is a much simplified version of that introduced by Carmody and Walters (Category Theory, Proceedings of the International Conference Held in Como, Italy, 22–28 July 1990. Springer) in 1991. The simplification allows us to give a straightforward proof of its correctness and termination when the extension is finite. c © 2003 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Using Rewriting Systems to Compute Left Kan Extensions and Induced Actions of Categories
The aim is to apply string-rewriting methods to compute left Kan extensions, or, equivalently, induced actions of monoids, categories, groups or groupoids. This allows rewriting methods to be applied to a greater range of situations and examples than before. The data for the rewriting is called a Kan extension presentation. The paper has its origins in earlier work by Carmody and Walters who ga...
متن کاملLeft Kan Extensions Over !-Cat
An existing procedure to compute left Kan extensions over the ground category Set also computes left Kan extensions over the ground categories Cat, 2-Cat, n-Cat for any n and indeed !-Cat. Therefore extension data struc-tured in this manner already can make use of the left Kan extension notion of a best possible approximation. Examples include systems of labeled transition systems and certain h...
متن کاملPostulated colimits and left exactness of Kan-extensions
If A is a small category and E a Grothendieck topos, the Kan extension LanF of a flat functor F : A → E along any functor A → D preserves whatever finite limits may exist in D; this is a well known fundamental result in topos theory. We shall present a metamathematical argument to derive out of this some other left exactness results, for Kan extensions with values in a (possibly large) site E. ...
متن کاملKan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick
Many program optimisations involve transforming a program in direct style to an equivalent program in continuation-passing style. This paper investigates the theoretical underpinnings of this transformation in the categorical setting of monads. We argue that so-called absolute Kan Extensions underlie this program optimisation. It is known that every Kan extension gives rise to a monad, the code...
متن کاملGröbner Basis Techniques for Computing Actions of K - Categories ∗
This paper involves categories and computer science. Gröbner basis theory is a branch of computer algebra which has been usefully applied to a wide range of problems. Kan extensions are a key concept of category theory capable of expressing most algebraic structures. The paper combines the two, using Gröbner basis techniques to compute certain kinds of Kan extension.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 35 شماره
صفحات -
تاریخ انتشار 2003